Constraint aggregation for rigorous global optimization
نویسندگان
چکیده
منابع مشابه
Constraint aggregation for rigorous global optimization
In rigorous constrained global optimization, upper bounds on the objective function help to reduce the search space. Their construction requires finding a narrow box around an approximately feasible solution, verified to contain a feasible point. Approximations are easily found by local optimization, but the verification often fails. In this paper we show that even if the verification of an app...
متن کاملCapabilities of Constraint Programming in Rigorous Global Optimization
We investigate the capabilities of constraints programming techniques to boost rigorous global optimization methods, and thus, to reduce the gap between efficient but unsafe systems like Baron1, and slow but safe global optimization approaches. We show how constraint programming filtering techniques can be used to implement optimality-based reduction in a safe and efficient way, and thus to tak...
متن کاملConstraint Satisfaction as Global Optimization
We present a optimization formulation for discrete binary CSP, based on the construction of a continuous function A(P) whose global maximum represents the best possible solution for that problem. By the best possible solution we mean either (i) a solution of the problem, if it is solvable, or (ii) a partial solution violating a minimal number of constraints, if the problem is unsolvable. This a...
متن کاملConstraint aggregation principle in convex optimization
A general constraint aggregation technique is proposed for convex optimization problems. At each iteration a set of convex inequalities and linear equations is replaced by a single inequality formed as a linear combination of the original constraints. After solving the simplified subproblem, new aggregation coefficients are calculated and the iteration continues. This general aggregation princi...
متن کاملRigorous constraint satisfaction for sampled linear systems
We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling instances. The proposed algorithm combines elements of classical branch and bound schemes from global optimization with a recently published procedure to bound the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2014
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-014-0851-4